An Efficient Multicore Algorithm for Minimal Length Addition Chains
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Optimal Addition Chains
The computational aspects of finding the shortest addition chains for an integer are investigated in this work. Theoretically developed lower and upper bounds for the minimal length of the addition chains for an integer are exploited to construct a subtle pruning function for backtracking algorithm. These techniques are finally combined to build an efficient algorithm for finding the optimal ad...
متن کاملOn the Number of Minimal Addition Chains
An addition chain for a natural number n is a sequence 1 = a0 < a1 < . . . < ar = n of numbers such that for each 0 < i ≤ r, ai = aj + ak for some 0 ≤ k ≤ j < i. Thurber [9] introduced the function NMC(n) which denotes the number of minimal addition chains for a number n. Thurber calculated NMC(n) for some classes of n, such as when n has one or two ones in its binary representation. Also, he c...
متن کاملAn efficient Imperialistic Competitive Algorithm for the closed-loop supply chains considering pricing for product, and fleet of heterogeneous vehicles
This paper investigates a pricing multi-period, closed-loop supply chains (CLSCs) with two echelons of producers and customers. Products are delivered to customers might be defective which are picked up and gathered in the collection center and will be fixed if it is possible and will be returned to the chain. Otherwise, they are sold as waste. This problem is determining price and distributio...
متن کاملAn Efficient Parallel Sorting Algorithm for Multicore Machines
Sorting an array of integers is one of the most basic problems in Computer Science. Also it is an issue in high performance database applications. Though literature is imbued with a variety of sorting algorithms, different architectures need different optimizations to reduce sorting time. This paper presents a Multicore ready parallel sorting algorithm which has been designed with Multicore/Man...
متن کاملA Simulated Annealing Algorithm for the Problem of Minimal Addition Chains
Cryptosystems require the computation of modular exponentiation, this operation is related to the problem of finding a minimal addition chain. However, obtaining the shortest addition chain of length n is an NP-Complete problem whose search space size is proportional to n!. This paper introduces a novel idea to compute the minimal addition chain problem, through an implementation of a Simulated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers
سال: 2019
ISSN: 2073-431X
DOI: 10.3390/computers8010023